Verifying π-calculus Processes by Promela Translation
نویسندگان
چکیده
In this paper, the possibility of verifying π-calculus processes via Promela translation is investigated. A general translation method from π-calculus processes to Promela models is presented and its usefulness is shown by performing verification tasks with translated π-calculus examples and SPIN. Model checking translated π-calculus processes in SPIN is shown to overcome shortcomings of the Mobility Workbench, which implements a theorem-proving style μ-calculus model checking algorithm for the π-calculus.
منابع مشابه
A Sequent Calculus for a First-order Dynamic Logic with Trace Modalities for Promela
We introduce the first-order dynamic logic DLP for Promela, a language subsuming the modelling language Promela of the Spin model checker. In DLP trace modalities can be used to reason about the temporal properties of programs. The definition of DLP includes a formal semantics of the Promela language. A sound and relatively complete sequent calculus is given, which allows deductive theorem prov...
متن کاملUsing SPIN to Model Check Concurrent Algorithms, using a translation from C to Promela
This paper addresses the problem of automatically verifying correctness of concurrent algorithms, e.g., as found in concurrent implementations of common data structures, using model checking. In order to use a model checker to analyze programs in, e.g., C, one must first translate programs to the input language of the model checker. Since our aim is to use SPIN, we present an automated translat...
متن کاملImplementing and Verifying Scenario-based Speciications Using Promela/xspin { Extended Abstract {
In previous work we de ned a nite state semantics for Message Sequence Charts (MSCs) and suggested a translation of MSC speci cations into Promela. We call this translation an `implementation'. In this paper we reconsider the implementation of MSCs and discuss what information needs to be added when implementingMSC speci cations containing so-called nonlocal choices. Next, we show how to model-...
متن کاملImplementing and Verifying Message Sequence Chart Speciications Using Promela/xspin
We discuss a translation of Message Sequence Charts (MSCs) into the language Promela (we call this translation anìmplementation') that is consistent with the formal semantics we have previously de-ned for Message Flow Graphs and Message Sequence Charts, which handled the syntactic features with mathematical import from ITU-T recommendation Z.120. We report on experiments executing the Promela c...
متن کاملImplementing and Verifying Msc Specifications Using Promela
We discuss a translation of Message Sequence Charts (MSCs) into the language PROMELA (we call this translation anìmplementation') that is consistent with the formal semantics we have previously deened for Message Flow Graphs and Message Sequence Charts, which handled the syntactic features with mathematical import from ITU-T recommendation Z.120. We report on experiments executing the PROMELA c...
متن کامل